Approximation algorithms for minimum tree partition

Approximation Algorithms for Minimum Tree Partition

We consider a problem of locating communication centers. In this problem, it is required to partition the set of n customers into subsets minimizing the length of nets required to connect all the customers to the communication centers. Suppose that communication centers are to be placed in p of the customers locations. The number of customers each center supports is also given. The problem rema...

Approximation Algorithms for Min-Max Tree Partition

We consider the problem of partitioning the node set of a graph into p equal sized subsets. The objective is to minimize the maximum length, over these subsets, of a minimum spanning tree. We show that no polynomial algorithm with bounded Ž 2 . error ratio can be given for the problem unless P s NP. We present an O n time algorithm for the problem, where n is the number of nodes in the graph. A...

Approximation Algorithms for Minimum

This paper deals with the problem of broadcasting in minimum time in the telephone and message-passing models. Approximation algorithms are developed for arbitrary graphs, as well as for several restricted graph classes. In particular, an O(p n)-additive approximation algorithm is given for broadcasting in general graphs, and an O(log log n= log n) (multiplicative) ratio approximation is given ...

Approximation Algorithms for Minimum Time Broadcast

This paper deals with the problem of broadcasting in minimum time in the telephone and message-passing models. Approximation algorithms are developed for arbitrary graphs as well as for several restricted graph classes. In particular, an O(vfvT)-additive approximation algorithm is given for broadcasting in general graphs, and an O(log n/ log log n) (multiplicative) ratio approximation is given ...

APPROXIMATION ALGORITHMS FOR MINIMUM - COST k - VERTEXCONNECTED